Searching the Integers (2006; Pǎtraşcu, Thorup)
نویسنده
چکیده
Consider an ordered universe U , and a set T ⊂ U with |T | = n. The goal is to preprocess T , such that the following query can be answered efficiently: given x ∈ U , report the predecessor of x, i.e. max{y ∈ T | y < x}. One can also consider the dynamic problem, where elements are inserted and deleted into T . Let tq be the query time, and tu the update time. This is a fundamental search problem, with an impressive number of applications. Later, this entry discusses IP lookup (forwarding packets on the Internet), orthogonal range queries and persistent data structures as examples. The problem was considered in many computational models. In fact, most models below were initially defined to study the predecessor problem.
منابع مشابه
Floats, Integers, and Single Source Shortest Paths
Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with oating point weights.
متن کاملUntangling the balancing and searching of balanced binary search trees
A Source code 2 A.1 Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 A.2 Searchers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.1 search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.2 selection search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملEquivalence between Sorting and Priority Queues
For a RAMwith arbitrary word size, it is shown that if we can sort n integers, each contained in one word, in time n s(n), then (and only then) there is a priority queue with capacity for n integers, supporting find-min in constant time and insert and delete in s(n)+O(1) amortized time. Here it is required that when we insert a key, it is not smaller than the current smallest key. The equivalen...
متن کاملInteger Sorting in O(nplog logn) Expected Time and Linear Space
We present a randomized algorithm sorting n integers in O(nplog logn) expected time and linear space. This improves the previous O(n log logn) bound by Anderson et al. from STOC’95. As an immediate consequence, if the integers are bounded by U , we can sort them in O(nplog logU) expected time. This is the first improvement over the O(n log logU) bound obtained with van Emde Boas’ data structure...
متن کاملExpected Time and Linear Space
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear space. This improves the previous O(n log logn) bound by Anderson et al. from STOC’95. As an immediate consequence, if the integers are bounded by U , we can sort them in O(n p log logU) expected time. This is the first improvement over the O(n log logU) bound obtained with van Emde Boas’ data struc...
متن کامل